Transfer of semantics from argumentation frameworks to logic programming A preliminary report

نویسندگان

  • Monika Adamova
  • Ján Sefránek
چکیده

There are various interesting semantics’ (extensions) designed for argumentation frameworks. They enable to assign a meaning, e.g., to odd-length cycles. Our main motivation is to transfer semantics’ proposed by Baroni, Giacomin and Guida for argumentation frameworks with odd-length cycles to logic programs with odd-length cycles through default negation. The developed construction is even stronger. For a given logic program an argumentation framework is defined. The construction enables to transfer each semantics of the resulting argumentation framework to a semantics of the given logic program. Weak points of the construction are discussed and some future continuations of this approach are

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logic program semantcs via an argumentation semantics

There are various semantics designed for argumentation frameworks. They enable to assign a meaning e.g. to odd-length cycles. Our main motivation is to transfer semantics proposed by Baroni, Giacomin and Guida for argumentation frameworks with odd-length cycles to logic programs with odd-length cycles through default negation. The developed construction is even stronger. For a given logic progr...

متن کامل

Revision of Abstract Dialectical Frameworks : Preliminary Report ∗

Abstract Dialectical Frameworks (ADFs) enhance the capability of Dung’s argumentation frameworks by modelling relations between arguments in a flexible way, thus constituting a very general formalism for abstract argumentation. Since argumentation is an inherently dynamic process, understanding how change in ADFs can be formalized is important. In this work we study AGM-style revision operators...

متن کامل

Representing Argumentation Frameworks in Answer Set Programming

This paper studies representation of argumentation frameworks (AFs) in answer set programming (ASP). Four different transformations from AFs to logic programs are provided under the complete semantics, stable semantics, grounded semantics and preferred semantics. The proposed transformations encode labelling-based argumentation semantics at the object level, and different semantics of AFs are u...

متن کامل

The DIAMOND System for Argumentation: Preliminary Report

Abstract dialectical frameworks (ADFs) are a powerful generalisation of Dung’s abstract argumentation frameworks. In this paper we present an answer set programming based software system, called DIAMOND (DIAlectical MOdels eNcoDing). It translates ADFs into answer set programs whose stable models correspond to models of the ADF with respect to several semantics (i.e. admissible, complete, stabl...

متن کامل

Contradiction in Argumentation Frameworks

We present a theory of argumentation that can deal with contradiction within an argumentation framework, thus solving a problem posed in [1]. By representing logic programs as sets of interacting arguments, we can apply our results for general argumentation frameworks to logicprogramming semantics. This yields a new semantics for logic programs that properly extends traditional approaches such ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1108.5281  شماره 

صفحات  -

تاریخ انتشار 2011